Multigrid Methods for Saddlepoint Problems Arising from Mortar Finite Element Discretizations
نویسنده
چکیده
A multigrid algorithm for saddle point problems arising from mortar nite element discretizations is analyzed. Here, we do not require that the constraints at the interface are satissed in each smoothing step. Using mesh dependent norms for the Lagrange multiplier, suitable approximation and smoothing properties are established. A convergence rate independent of the meshsize is obtained for the W-cycle.
منابع مشابه
A general framework for multigrid methods for mortar finite elements
In this paper, a general framework for the analysis of multigrid methods for mortar finite elements is considered. The numerical realization is based on the algebraic saddle point formulation arising from the discretization of second order elliptic equations on nonmatching grids. Suitable discrete Lagrange multipliers on the interface guarantee weak continuity and an optimal discretization sche...
متن کاملA Multigrid Algorithm for the Mortar Finite Element Method
The objective of this paper is to develop and analyse a multigrid algorithm for the system of equations arising from the mortar nite element discretization of second order elliptic boundary value problems. In order to establish the inf-sup condition for the saddle point formulation and to motivate the subsequent treatment of the discretizations we revisit rst brieey the theoretical concept of t...
متن کاملDuality Estimates and Multigrid Analysis for Saddle Point Problems Arising from Mortar Discretizations
متن کامل
Multigrid for the Mortar Finite Element Method
A multigrid technique for uniformly preconditioning linear systems arising from a mortar finite element discretization of second order elliptic boundary value problems is described and analyzed. These problems are posed on domains partitioned into subdomains, each of which is independently triangulated in a multilevel fashion. The multilevel mortar finite element spaces based on such triangulat...
متن کاملParallel linear algebra and the application to multigrid methods
We explain a general model for a parallel linear algebra. All algebraic operations and parallel extensions are defined formally, and it is shown that in this model multigrid methods on a distributed set of indices can be realized. This abstract formalization leads to an automatic realization of parallel methods for time-dependent and nonlinear partial differential equations and the solution of ...
متن کامل